Unique Fixpoint Induction for Value-passing Processes
نویسنده
چکیده
We investigate the use of unique xpoint induction as a proof method for value-passing process languages with recursion. An intuitive generalisation of unique xpoint induction based on loop invariants for symbolic graphs yields strong completeness results; we give an axiomatic characterisation of both late and early observational congruence for a class of fully parameterised processes. This new, generalised, rule is shown to be derivable from existing formulations of unique xpoint induction for value-passing calculi, thereby providing original completeness results. An example of the use of this new rule is presented in detail.
منابع مشابه
Unique fixpoint induction for message-passing process calculi
We present a proof system for message-passing process calculi with recursion. The key inference rule to deal with recursive processes is a version of Unique Fixpoint Induction for process abstractions. We prove the proof system is sound and also complete for a restricted form of regular message-passing processes. We also show that the system is incomplete in general and discuss more powerful ex...
متن کاملSymbolic Techniques for Value-passing Calculi
We investigate the use of symbolic operational semantics for value-passing process languages. Symbolic semantics provide analytical tools for reasoning about particular infinite state systems where traditional methods fail. We eschew the use of Milner’s encoding of value-passing agents into pure process algebra and advocate the treatment of value-passing terms as first-order processes proper. S...
متن کاملUsing Metrics for Proof Rules for Recursively Defined Delay-insensitive Specifications
An advantage of algebraic specifications of delay insensitive asynchronous processes over most other formalisms is that it allows the recursive definition of processes, and correctness proofs of an implementation through fixpoint induction. On the other hand, proofs by fixpoint induction are intrinsically hard to design and read, which led us to use a much more palatable proof style, using so-c...
متن کاملSearching for a Solution to Program Verification=Equation Solving in CCS
Unique Fixpoint Induction, UFI, is a chief inference rule to prove the equivalence of recursive processes in CCS [7]. It plays a major role in the equational approach to verification. This approach is of special interest as it offers theoretical advantages in the analysis of systems that communicate values, have infinite state space or show parameterised behaviour. The use of UFI, however, has ...
متن کاملComputation of Ruin Probabilities for General Discrete-time Markov Models
We study the ruin problem over a risk process described by a discrete-time Markov model. In contrast to previous studies that focused on the asymptotic behaviour of ruin probabilities for large values of the initial capital, we provide a new technique to compute the quantity of interest for any initial value, and with any given precision. Rather than focusing on a particular model for risk proc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997